Adaptive Sampling for Sparse Recovery

نویسندگان

  • Ali Tajer
  • H. Vincent Poor
چکیده

Consider n data sequences, each consisting of independent and identically distributed elements drawn from one of the two possible zero-mean Gaussian distributions with variances A0 and A1. The problem of quickly identifying all of the sequences with varianceA1 is considered and an adaptive two-stage experimental design and testing procedure is proposed. The agility and reliability gains in comparison with the existing related methods for quick search over multiple sequences are quantified..

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative methods for random sampling and compressed sensing recovery

In this paper, two methods are proposed which address the random sampling and compressed sensing recovery problems. The proposed random sampling recovery method is the Iterative Method with Adaptive Thresholding and Interpolation (IMATI). Simulation results indicate that the proposed method outperforms existing random sampling recovery methods such as Iterative Method with Adaptive Thresholding...

متن کامل

NEW THEORY AND METHODS IN ADAPTIVE AND COMPRESSIVE SAMPLING FOR SPARSE DISCOVERY by Jarvis

The study of sparsity has recently garnered significant attention in the signal processing and statistics communities. Generally speaking, sparsity describes the phenomenon where a large data set may be succinctly represented or approximated using only a small number of summary values or coefficients. The implications are clear—the presence of sparsity suggests the potential for efficient metho...

متن کامل

Measurement-adaptive Sparse Image Sampling and Recovery

This paper presents an adaptive and intelligent sparse model for digital image sampling and recovery. In the proposed sampler, we adaptively determine the number of required samples for retrieving image based on space-frequency-gradient information content of image patches. By leveraging texture in space, sparsity locations in DCT domain, and directional decomposition of gradients, the sampler ...

متن کامل

Block Based Compressive Sensing for GPR Images by Using Noiselet and Haar Wavelet

ompressive sensing (CS) is a new method for image sampling in contrast with well-known Nyquist sampling theorem. In addition to the sampling and sparse domain which play an important role in perfect signal recovery on CS framework, the recovery algorithm which has been used also has effects on the reconstructed image. In this paper, the performance of four recovery algorithms are compared accor...

متن کامل

Block-Based Compressive Sensing Using Soft Thresholding of Adaptive Transform Coefficients

Compressive sampling (CS) is a new technique for simultaneous sampling and compression of signals in which the sampling rate can be very small under certain conditions. Due to the limited number of samples, image reconstruction based on CS samples is a challenging task. Most of the existing CS image reconstruction methods have a high computational complexity as they are applied on the entire im...

متن کامل

Distilled sensing: selective sampling for sparse signal recovery

A selective sampling procedure called distilled sensing (DS) is proposed, and shown to be an effective method for recovering sparse signals in noise. Based on the notion that it is often easier to rule out locations that do not contain signal than it is to directly identify non-zero signal components, DS is a sequential method that systematically focuses sensing resources towards the signal sub...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011